منابع مشابه
Orders on Multisets and Discrete Cones
We study additive representability of orders on multisets (of size k drawn from a set of size n) which satisfy the condition of Independence of Equal Submultisets (IES) introduced by Sertel and Slinko (2002, 2007). Here we take a geometric view of those orders, and relate them to certain combinatorial objects which we call discrete cones. Following Fishburn (1996) and Conder and Slinko (2004), ...
متن کاملDiscrete Cones and Carathéodory’s Theorem
Discrete cones, in systematic terminology: normal affine semigroups, represent the link between branches of mathematics that, at first sight, seem to be extremely distant from one another, i.e. combinatorial geometry and discrete optimisation on the one hand, and algebraic geometry and commutative algebra on the other. These branches and the links between them have been researched intensively i...
متن کاملStirling permutations on multisets
A permutation σ of a multiset is called Stirling permutation if σ(s) ≥ σ(i) as soon as σ(i) = σ(j) and i < s < j. In our paper we study Stirling polynomials that arise in the generating function for descent statistics on Stirling permutations of any multiset. We develop generalizations of the classical Stirling numbers and present their combinatorial interpretations. Particularly, we apply the ...
متن کاملProbabilistic Stable Functions on Discrete Cones are Power Series
We study the category Cstabm of measurable cones and measurable stable functions—a denotational model of an higher-order language with continuous probabilities and full recursion [8]. We look at Cstabm as a model for discrete probabilities, by showing the existence of a full and faithful functor preserving cartesian closed structure which embeds probabilistic coherence spaces—a fully abstract d...
متن کاملSynergistic Solutions on MultiSets
Karp et al. (1988) described Deferred Data Structures for Multisets as “lazy” data structures which partially sort data to support online rank and select queries, with the minimum amount of work in the worst case over instances of size n and number of queries q fixed. Barbay et al. (2016) refined this approach to take advantage of the gaps between the positions hit by the queries (i.e., the str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Order
سال: 2007
ISSN: 0167-8094,1572-9273
DOI: 10.1007/s11083-007-9073-1